Systematic approaches to generate reversiblizations of Markov chains
نویسندگان
چکیده
Given a target distribution π and an arbitrary Markov infinitesimal generator L on finite state space χ, we develop three structured inter-related approaches to generate new reversiblizations from . The first approach hinges geometric perspective, in which view as projections onto the of π-reversible generators under suitable information divergences such xmlns:xlink="http://www.w3.org/1999/xlink">f -divergences. With different choices functions , not only recover nearly all established but also unravel reversiblizations. Along way, unveil interesting results bisection properties, Pythagorean identities, parallelogram laws chain counterpart arithmetic-geometric-harmonic mean inequality governing these This further serves motivation for introducing notion centroids sequence chains give conditions their existence uniqueness. Building upon approach, generalized means. In this second construct via natural notions means Cauchy or dual mean. third combine recently introduced locally-balanced processes framework convex ∗-conjugate study -divergence. latter offers rich source balancing
منابع مشابه
Spatial Mixing and Systematic Scan Markov chains
We consider spin systems on the integer lattice graph Z with nearest-neighbor interactions. We develop a combinatorial framework for establishing that exponential decay with distance of spin correlations, specifically the strong spatial mixing condition (SSM), implies rapid mixing of a large class of Markov chains. As a first application of our method we prove that SSM implies O(log n) mixing o...
متن کاملEmpirical Bayes Estimation in Nonstationary Markov chains
Estimation procedures for nonstationary Markov chains appear to be relatively sparse. This work introduces empirical Bayes estimators for the transition probability matrix of a finite nonstationary Markov chain. The data are assumed to be of a panel study type in which each data set consists of a sequence of observations on N>=2 independent and identically dis...
متن کاملTaylor Expansion for the Entropy Rate of Hidden Markov Chains
We study the entropy rate of a hidden Markov process, defined by observing the output of a symmetric channel whose input is a first order Markov process. Although this definition is very simple, obtaining the exact amount of entropy rate in calculation is an open problem. We introduce some probability matrices based on Markov chain's and channel's parameters. Then, we try to obtain an estimate ...
متن کاملThe Rate of Rényi Entropy for Irreducible Markov Chains
In this paper, we obtain the Rényi entropy rate for irreducible-aperiodic Markov chains with countable state space, using the theory of countable nonnegative matrices. We also obtain the bound for the rate of Rényi entropy of an irreducible Markov chain. Finally, we show that the bound for the Rényi entropy rate is the Shannon entropy rate.
متن کاملNew Approaches in Meta-heuristics to Schedule Purposeful Inspections of Workshops in Manufacturing Supply Chains
Nowadays, with the growth of technology and the industrialization of societies, work-related accidents, and consequently the threat of human capital and material resources are among the problems of the countries of the world. The most important legal solution in most countries to control occupational accidents and illnesses is to conduct periodic site visits and identify hazardous sites. To the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2023
ISSN: ['0018-9448', '1557-9654']
DOI: https://doi.org/10.1109/tit.2023.3304685